Subexponential Time Algorithms for Embedding H-Minor Free Graphs

We establish the complexity of several graph embedding problems: Subgraph Isomorphism, Graph Minor, Induced Subgraph and Induced Minor, when restricted to H-minor free graphs. In each of these problems, we are given a pattern graph P and a host graph G, and want to determine whether P is a subgraph (minor, induced subgraph or induced minor) of G. We show that, for any fixed graph H and > 0, if P is H-Minor Free and G has treewidth tw, (induced) subgraph can be solved 2O(k tw+k/ log k)nO(1) time and (induced) minor can be solved in 2O(k tw+tw log tw+k/ log k)nO(1) time, where k = |V (P )|. We also show that this is optimal, in the sense that the existence of an algorithm for one of these problems running in 2o(n/ logn) time would contradict the Exponential Time Hypothesis. This solves an open problem on the complexity of Subgraph Isomorphism for planar graphs. The key algorithmic insight is that dynamic programming approaches can be sped up by identifying isomorphic connected components in the pattern graph. This technique seems widely applicable, and it appears that there is a relatively unexplored class of problems that share a similar upper and lower bound. 1998 ACM Subject Classification G.2.2 Graph Algorithms